منابع مشابه
On connectivity of consecutive-d digraphs
The concept of a consecutive-d digraph was proposed by Du, Hsu and Hwang as a generalization of de Bruijn digraphs, Kautz digraphs, and their generalizations given by Imase and Itoh and Reddy, Pradhan and Kuhl. In this paper we determine the connectivity of consecutive-d digraphs and study how to modify consecutive-d digraphs to reach maximum connectivity. Our results will generalize and improv...
متن کاملThe consecutive-4 digraphs are Hamiltonian
Du, Hsu, and Hwang conjectured that consecutive-d digraphs are Hamiltonian for d = 3, 4. Recently, we gave an infinite class of consecutive-3 digraphs, which are not Hamiltonian. In this article we prove the conjecture for d = 4. c © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 1–6, 1999
متن کاملRestricted Edge-Connectivity of de Bruijn Digraphs
The restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of interconnection networks. This paper determines that the restricted edge-connectivity of the de Bruijn digraph B(d, n) is equal to 2d − 2 for d ≥ 2 and n ≥ 2 except B(2, 2). As consequences, the super edge-connectedness of B(d, n) is obtained immediately.
متن کاملSuper Connectivity of Line Graphs and Digraphs
The h-super connectivity κh and the h-super edge-connectivity λh are more refined network reliability indices than the connectivity and the edge-connectivity. This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1(L) = 2λ1(D), and that for a connected graph G and its line graph L, if one of κ1(L) and λ2(G) exists, then κ1...
متن کاملConnectivity of some Algebraically Defined Digraphs
Let p be a prime, e a positive integer, q = pe, and let Fq denote the finite field of q elements. Let fi : Fq → Fq be arbitrary functions, where 1 6 i 6 l, i and l are integers. The digraph D = D(q; f), where f = (f1, . . . , fl) : Fq → Fq, is defined as follows. The vertex set of D is Fl+1 q . There is an arc from a vertex x = (x1, . . . , xl+1) to a vertex y = (y1, . . . , yl+1) if xi + yi = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90131-s